منابع مشابه
Tightening Bounds for Bayesian Network Structure Learning
A recent breadth-first branch and bound algorithm (BFBnB) for learning Bayesian network structures (Malone et al. 2011) uses two bounds to prune the search space for better efficiency; one is a lower bound calculated from pattern database heuristics, and the other is an upper bound obtained by a hill climbing search. Whenever the lower bound of a search path exceeds the upper bound, the path is...
متن کاملFeasibility-Based Bounds Tightening via Fixed Points
The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ranges at every tree node. A range reduction technique often employed is called Feasibility Based Bounds Tightening, which is known to be practically fast, and is thus deployed at every node of the search tree. From time to tim...
متن کاملTightening Critical Section Bounds in Mixed-Criticality Systems through Preemptible Hardware Transactional Memory
Ideally, mixed criticality systems should allow architects to consolidate separately certified tasks with differing safety requirements into a single system. Consolidated, they are able to share resources (even across criticality levels) and reduce the system’s size, weight and power demand. To achieve this, higher criticality tasks are also subjected to the analysis methods suitable for lower ...
متن کاملTightening Upper Bounds of Utility Values in Utility Mining
Utility mining in data mining has recently been an emerging research issue due to its practical applications. In this paper, with the concept of projection technique, we propose an efficient algorithm for finding high utility itemsets in databases. In particular, an improved upper-bound strategy in the proposed algorithm is designed to further tighten the upper bounds of the utility values for ...
متن کاملTightening simple mixed-integer sets with guaranteed bounds
In this paper we consider 0/1 knapsack sets and certain simple fixed-charge network flow sets. The study of such sets is relevant in that a popular approach for solving general mixed-integer programs consists of selecting a subset of constraints with particular structure (such as a single-node fixedcharge flow problem) and tightening that part of the formulation through the use, for example, of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2014
ISSN: 1556-5068
DOI: 10.2139/ssrn.2457275